On Eigenvector Bounds
نویسنده
چکیده
There are methods to compute error bounds for a multiple eigenvalue together with an inclusion of a basis of the corresponding invariant subspace. Those methods have no restriction with respect to the structure of Jordan blocks, but they do not provide an inclusion of a single eigenvector. In this note we first show under general assumptions that a narrow inclusion of a single eigenvector is not likely in case of corresponding eigenvalue with geometric multiplicity greater than one. We show a similar result if attention is restricted to symmetric or Hermitian matrices. Finally, we present an inclusion theorem for the eigenvector to an eigenvalue of geometric multiplicity one. Some numerical examples demonstrate the numerical applicability.
منابع مشابه
Computation of Bounds for the Positive Eigenvector of a Nonnegative Irreducible Matrix by Monotone Iteration
A method for the computation of iterative bounds for the positive eigenvector of a nonnegative irreducible matrix is presented. It is based on the P-boundedness of the corresponding fixed point operator. Admissible initial bounds can be obtained by conditional preiteration.
متن کاملEstimating a Largest Eigenvector by Polynomial Algorithms with a Random Start
In 7] and 8], the power and Lanczos algorithms with random start for estimating the largest eigenvalue of an n n large symmetric positive deenite matrix were analyzed. In this paper we continue this study by estimating an eigenvector corresponding to the largest eigenvalue. We analyze polynomial algorithms using Krylov information for two error criteria: the randomized error and the randomized ...
متن کاملA sin 2 Theorem for Graded Inde nite Hermitian Matrices 1
This paper gives double angle theorems that bound the change in an invariant subspace of an indeenite Hermitian matrix in the graded form H = D AD subject to a perturbation H ! e H = D (A + A)D. These theorems extend recent results on a deenite Hermitian matrix in the graded form (Linear Algebra Appl., 311 (2000), 45{60) but the bounds here are more complicated in that they depend on not only r...
متن کامل1 Bounds for the Dominant Eigenvector of a Graph
In this note we prove lower bounds on the components of the eigenvector associated with the dominant eigenvalue of a graph. These bounds depend only on the eccentricity of the corresponding node and on the eigenvalue As corrollary lower bounds on the dominant eigenvalue are derived, which depend on the diameter of the graph. These bounds were motivated by a heuristic algorithm for finding perip...
متن کاملGuaranteed and Robust a Posteriori Bounds for Laplace Eigenvalues and Eigenvectors: Conforming Approximations
This paper derives a posteriori error estimates for conforming numerical approximations of the Laplace eigenvalue problem with a homogeneous Dirichlet boundary condition. In particular, upper and lower bounds for an arbitrary simple eigenvalue are given. These bounds are guaranteed, fully computable, and converge with optimal speed to the given exact eigenvalue. They are valid without restricti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005